Scenario decomposition of risk-averse multistage stochastic programming problems
نویسندگان
چکیده
We briefly discuss some history on the development of risk-averse optimization leading into coherent risk measures. For a riskaverse multistage stochastic optimization problem with a finite scenario tree, we introduce a new scenario decomposition method and prove its convergence. We then show how to apply our method to a typical operations management inventory and assembly problem. BIOGRAPHY Dr. Ricardo Collado is an assistant professor in the Howe School of Technology Management. He received his BS in Mathematics and Computer Science from the University of Puerto Rico and his Ph.D. in Operations Research from Rutgers University, New Jersey. Prior to joining Stevens in 2013, he was an Assistant Professor/Faculty Fellow at NYU’s Stern School of Business and a Professional Specialist at the Department of Operations Research and Financial Engineering from Princeton University. His research focuses on decision-making in the face of uncertainty and risk. Ricardo’s main research tools are Stochastic Optimization and Dynamic Programming, these coupled with a novel theory of Risk Measures. His main areas of applications are Energy and Financial Markets, and problems related to National Security. In addition, Ricardo has experience in Theoretical Computer Science, Graph Theory, Discrete Mathematics, and more classical mathematics such as Real and Complex Analysis, Topology, and Abstract Algebra. EVENT DETAILS Research Colloquium
منابع مشابه
Convergence Analysis of Sampling-Based Decomposition Methods for Risk-Averse Multistage Stochastic Convex Programs
We consider a class of sampling-based decomposition methods to solve risk-averse multistage stochastic convex programs. We prove a formula for the computation of the cuts necessary to build the outer linearizations of the recourse functions. This formula can be used to obtain an efficient implementation of Stochastic Dual Dynamic Programming applied to convex nonlinear problems. We prove the al...
متن کاملTime consistency of dynamic risk measures
In this paper we discuss time consistency of risk averse multistage stochastic programming problems. We show, in a framework of finite scenario trees, that composition of law invariant coherent risk measures can be law invariant only for the expectation or max-risk measures.
متن کاملSampling-Based Decomposition Methods for Multistage Stochastic Programs Based on Extended Polyhedral Risk Measures
We define a risk-averse nonanticipative feasible policy for multistage stochastic programs and propose a methodology to implement it. The approach is based on dynamic programming equations written for a risk-averse formulation of the problem. This formulation relies on a new class of multiperiod risk functionals called extended polyhedral risk measures. Dual representations of such risk functio...
متن کاملTime-consistent approximations of risk-averse multistage stochastic optimization problems
OF THE DISSERTATION TIME-CONSISTENT APPROXIMATIONS OF RISK-AVERSE MULTISTAGE STOCHASTIC OPTIMIZATION PROBLEMS by Tsvetan Asamov Dissertation Director: Andrzej Ruszczyński In this work we study the concept of time consistency as it relates to multistage risk-averse stochastic optimization problems on finite scenario trees. We use dynamic time-consistent formulations to approximate problems havin...
متن کاملRisk neutral and risk averse Stochastic Dual Dynamic Programming method
In this paper we discuss risk neutral and risk averse approaches to multistage (linear) stochastic programming problems based on the Stochastic Dual Dynamic Programming (SDDP) method. We give a general description of the algorithm and present computational studies related to planning of the Brazilian interconnected power system. 2012 Elsevier B.V. All rights reserved.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Annals OR
دوره 200 شماره
صفحات -
تاریخ انتشار 2012